Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
نویسندگان
چکیده
Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In this paper a Genetic Programming system based on linear-tree genome structures developed for the purpose of automatic quantum circuit design is introduced. It was applied to instances of the 1-SAT problem, resulting in evidently and “visibly” scalable quantum algorithms, which correspond to Hogg’s quantum algorithm.
منابع مشابه
Guiding Genetic Program Based Data Mining Using Fuzzy Rules
A data mining procedure for automatic determination of fuzzy decision tree structure using a genetic program is discussed. A genetic program (GP) is an algorithm that evolves other algorithms or mathematical expressions. Methods for accelerating convergence of the data mining procedure are examined. The methods include introducing fuzzy rules into the GP and a new innovation based on computer a...
متن کاملGenetic program based data mining of fuzzy decision trees and methods of improving convergence and reducing bloat
A data mining procedure for automatic determination of fuzzy decision tree structure using a genetic program (GP) is discussed. A GP is an algorithm that evolves other algorithms or mathematical expressions. Innovative methods for accelerating convergence of the data mining procedure and reducing bloat are given. In genetic programming, bloat refers to excessive tree growth. It has been observe...
متن کاملEvolving Crossover Operators for Function Optimization
A new model for evolving crossover operators for evolutionary function optimization is proposed in this paper. The model is a hybrid technique that combines a Genetic Programming (GP) algorithm and a Genetic Algorithm (GA). Each GP chromosome is a tree encoding a crossover operator used for function optimization. The evolved crossover is embedded into a standard Genetic Algorithm which is used ...
متن کاملEvolving accurate and compact classification rules with gene expression programming
Classification is one of the fundamental tasks of data mining. Most rule induction and decision tree algorithms perform local, greedy search to generate classification rules that are often more complex than necessary. Evolutionary algorithms for pattern classification have recently received increased attention because they can perform global searches. In this paper, we propose a new approach fo...
متن کاملApplication of Genetic Programming toInduction of Linear Classi cation
A common problem in datamining is to nd accurate classi-ers for a dataset. For this purpose, genetic programming (GP) is applied to a set of benchmark classiication problems. Using GP, we are able to induce decision trees with a linear combination of variables in each function node. A new representation of decision trees using Strong Typing in GP is introduced. With this representation it is no...
متن کامل